A Formal Syntax of Natural Languages and the Deductive Grammar

نویسنده

  • Yingxu Wang
چکیده

Streszczenie. This paper presents a formal syntax framework of natural languages for computational linguistics. The abstract syntax of natural languages, particularly English, and their formal manipulations are described. On the basis of the abstract syntax, a universal language processing model and the deductive grammar of English are developed toward the formalization of Chomsky’s universal grammar in linguistics. Comparative analyses of natural and programming languages, as well as the linguistic perception on software engineering, are discussed. A wide range of applications of the deductive grammar of English have been explored in language acquisition, comprehension, generation, and processing in cognitive informatics, computational intelligence, and cognitive computing.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SQUALL: A Controlled Natural Language for Querying and Updating RDF Graphs

Formal languages play a central role in the Semantic Web. An important aspect regarding their design is syntax as it plays a crucial role in the wide acceptance of the Semantic Web approach. The main advantage of controlled natural languages (CNL) is to reconcile the high-level and natural syntax of natural languages, and the precision and lack of ambiguity of formal languages. In the context o...

متن کامل

Montague Grammars as Deductive Databases

This paper presents a technique for further applications of deductive databases in the eld of natural language processing. Although there were enormous research eeorts on analyzing the semantics of natural languages (NL), especially using Montague grammars (PTQ) for Prolog, corresponding programs for deductive databases are still missing, since range restriction is required in nearly all deduct...

متن کامل

Meaning to Learn: Bootstrapping Semantics to Infer Syntax

Context-free grammars cannot be identified in the limit from positive examples (Gold 1967), yet natural language grammars are more powerful than context-free grammars and humans learn them with remarkable ease from positive examples (Marcus 1993). Identifiability results for formal languages ignore a potentially powerful source of information available to learners of natural languages, namely, ...

متن کامل

Thesis for the Degree of Doctor of Philosophy Formal and Informal Software Specifications

The topic of this thesis is to bridge the gap between formal and informal software specifications. Formal specifications are required for the use of formal methods to verify the correctness of software. If we expect formal methods to be used in realistic software development projects, we need to enable people with varying levels of familiarity with formal specification languages to understand, ...

متن کامل

Inductive vs. Deductive Grammar Instruction and the Grammatical Performance of EFL Learners

Learning a foreign language offers a great challenge to students since it involves learning different skills and subskills. Quite a few number of researches have been done so far on the relationship between gender and learning a foreign language. On the other hand, two major approaches in teaching grammar have been offered by language experts, inductive and deductive. The present study examines...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Fundam. Inform.

دوره 90  شماره 

صفحات  -

تاریخ انتشار 2009